Complexity Measures and De ision Tree Complexity: A Survey

نویسنده

  • Harry Buhrman
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity measures and decision tree complexity: a survey

We discuss several complexity measures for Boolean functions: certiicate complexity, sensitivity , block sensitivity, and the degree of a representing or approximating polynomial. We survey the relations and biggest gaps known between these measures, and show how they give bounds for the decision tree complexity of Boolean functions on deterministic, randomized, and quantum computers.

متن کامل

Rademacher Penalization over Decision Tree Prunings

De ision Tree Prunings Matti K aari ainen and Tapio Elomaa Department of Computer S ien e, University of Helsinki, Finland fmatti.kaariainen,elomaag s.helsinki.fi Abstra t. Radema her penalization is a modern te hnique for obtaining data-dependent bounds on the generalization error of lassi ers. It would appear to be limited to relatively simple hypothesis lasses beause of omputational omple...

متن کامل

On Decision Boundaries of Naïve Bayes in Continuous Domains

in Continuous Domains Tapio Elomaa and Juho Rousu Department of Computer S ien e, University of Helsinki, Finland {elomaa,rousu} s.helsinki.fi Abstra t. Naïve Bayesian lassi ers assume the onditional independen e of attribute values given the lass. Despite this in pra ti e often violated assumption, these simple lassi ers have been found e ient, e e tive, and robust to noise. Dis retization of ...

متن کامل

Counting Complexity Classes

Shripad Thite May 11, 1998 Abstra t The ounting omplexity lasses are de ned in terms of the number of a epting omputation paths of nondetereministi polynomial-time Turing ma hines. They are, therefore, the ounting versions of de ision problems in NP. We review the properties of well-known ounting lasses like #P, P, GapP, SPP et . We also give an overview of the proof of Toda's theorem that rela...

متن کامل

A New Approach to Detect Congestive Heart Failure Using Symbolic Dynamics Analysis of Electrocardiogram Signal

The aim of this study is to show that the measures derived from Electrocardiogram (ECG) signals many a time perform better than the same measures obtained from heart rate (HR) signals. A comparison was made to investigate how far the nonlinear symbolic dynamics approach helps to characterize the nonlinear properties of ECG signals and HR signals, and thereby discriminate between normal and cong...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007